A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning
نویسندگان
چکیده
منابع مشابه
Towards a Diagrammatic Reasoning System for Description Logics
Diagrammatic reasoning is a tradition of visual logic that allows sentences that are equivalent to first order logic to be written in a visual or structural form: typically for improved usability. A calculus for the diagram is then defined that allows well-formed formulas to be derived. This calculus is intended to simulate logical inference. Description logics (DLs) have become a popular sub-s...
متن کاملImplementing and Evaluating Provers for First-order Modal Logics
While there is a broad literature on the theory of firstorder modal logics, little is known about practical reasoning systems for them. This paper presents several implementations of fully automated theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus, an embedding into simple type theor...
متن کاملDeveloping a model to enhance elementary teachers’ ability to foster functional thinking and algebraic reasoning in elementary students
Abstract: This study explores the process of change of grades 3 to 5 elementary teachers, who participated in a professional development program "Algebraic Thinking: Foundation of Elementary Mathematics". Algebraic thinking as a functional thinking was the centerpiece of the program. The “Concern Base Adaptation Model” (CBAM) was used as methodology. The results of the study showed the signific...
متن کاملA Framework for Using Knowledge in Tableau Proofs
The problem of automatically reasoning using a knowledge base containing axioms, deenitions and theorems from a rst-order theory is recurrent in automated reasoning research. Here we present a sound and complete method for reasoning over an arbitrary rst-order theory using the tableau calculus. A natural, well-motivated and simple restriction (implemented in IPR) to the method provides a powerf...
متن کاملar X iv : 1 70 2 . 03 09 6 v 6 [ cs . L O ] 3 M ay 2 01 7 A set - theoretic approach to ABox reasoning services ( Extended Version )
In this paper we consider the most common ABox reasoning services for the description logic DL〈4LQS〉(D) (DL D , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQS. The description logic DL D is very expressive, as it admits various concept and role constructs, and data types, that allow one to represent rule-based languages ...
متن کامل